0.07/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM 0.11/0.34 % Computer : n001.cluster.edu 0.11/0.34 % Model : x86_64 x86_64 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.34 % Memory : 8042.1875MB 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.34 % CPULimit : 1920 0.11/0.34 % WCLimit : 240 0.11/0.34 % DateTime : Wed Jul 30 08:47:04 EDT 2025 0.11/0.34 % CPUTime : 0.20/0.49 Running higher-order theorem proving 0.20/0.51 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.K6gLfAsRkc/E---3.1_27469.p 1.44/0.72 # Version: 3.0.0-ho 1.44/0.72 # Preprocessing class: HSLMSMSSLLLCHSA. 1.44/0.72 # Scheduled 6 strats onto 8 cores with 240 seconds (1920 total) 1.44/0.72 # Starting lpo1_fix with 720s (3) cores 1.44/0.72 # Starting full_lambda_9 with 240s (1) cores 1.44/0.72 # Starting almost_fo_4 with 240s (1) cores 1.44/0.72 # Starting new_ho_9 with 240s (1) cores 1.44/0.72 # Starting pre_casc_4 with 240s (1) cores 1.44/0.72 # Starting ho_unfolding_6 with 240s (1) cores 1.44/0.72 # ho_unfolding_6 with pid 27552 completed with status 0 1.44/0.72 # Result found by ho_unfolding_6 1.44/0.72 # Preprocessing class: HSLMSMSSLLLCHSA. 1.44/0.72 # Scheduled 6 strats onto 8 cores with 240 seconds (1920 total) 1.44/0.72 # Starting lpo1_fix with 720s (3) cores 1.44/0.72 # Starting full_lambda_9 with 240s (1) cores 1.44/0.72 # Starting almost_fo_4 with 240s (1) cores 1.44/0.72 # Starting new_ho_9 with 240s (1) cores 1.44/0.72 # Starting pre_casc_4 with 240s (1) cores 1.44/0.72 # Starting ho_unfolding_6 with 240s (1) cores 1.44/0.72 # No SInE strategy applied 1.44/0.72 # Search class: HGHSM-FSLM32-DHSMMSBN 1.44/0.72 # partial match(1): HGHSM-FSLM32-MHSMMSBN 1.44/0.72 # Scheduled 11 strats onto 1 cores with 240 seconds (240 total) 1.44/0.72 # Starting full_lambda_5 with 22s (1) cores 1.44/0.72 # full_lambda_5 with pid 27554 completed with status 0 1.44/0.72 # Result found by full_lambda_5 1.44/0.72 # Preprocessing class: HSLMSMSSLLLCHSA. 1.44/0.72 # Scheduled 6 strats onto 8 cores with 240 seconds (1920 total) 1.44/0.72 # Starting lpo1_fix with 720s (3) cores 1.44/0.72 # Starting full_lambda_9 with 240s (1) cores 1.44/0.72 # Starting almost_fo_4 with 240s (1) cores 1.44/0.72 # Starting new_ho_9 with 240s (1) cores 1.44/0.72 # Starting pre_casc_4 with 240s (1) cores 1.44/0.72 # Starting ho_unfolding_6 with 240s (1) cores 1.44/0.72 # No SInE strategy applied 1.44/0.72 # Search class: HGHSM-FSLM32-DHSMMSBN 1.44/0.72 # partial match(1): HGHSM-FSLM32-MHSMMSBN 1.44/0.72 # Scheduled 11 strats onto 1 cores with 240 seconds (240 total) 1.44/0.72 # Starting full_lambda_5 with 22s (1) cores 1.44/0.72 # Preprocessing time : 0.008 s 1.44/0.72 # Presaturation interreduction done 1.44/0.72 1.44/0.72 # Proof found! 1.44/0.72 # SZS status Theorem 1.44/0.72 # SZS output start CNFRefutation 1.44/0.72 thf(decl_23, type, is_of: $i > ($i > $o) > $o). 1.44/0.72 thf(decl_24, type, all_of: ($i > $o) > ($i > $o) > $o). 1.44/0.72 thf(decl_26, type, in: $i > $i > $o). 1.44/0.72 thf(decl_62, type, imp: $o > $o > $o). 1.44/0.72 thf(decl_63, type, d_not: $o > $o). 1.44/0.72 thf(decl_72, type, non: $i > ($i > $o) > $i > $o). 1.44/0.72 thf(decl_73, type, l_some: $i > ($i > $o) > $o). 1.44/0.72 thf(decl_78, type, e_is: $i > $i > $i > $o). 1.44/0.72 thf(decl_124, type, nat: $i). 1.44/0.72 thf(decl_125, type, n_is: $i > $i > $o). 1.44/0.72 thf(decl_128, type, n_some: ($i > $o) > $o). 1.44/0.72 thf(decl_143, type, n_pl: $i > $i > $i). 1.44/0.72 thf(decl_148, type, diffprop: $i > $i > $i > $o). 1.44/0.72 thf(decl_150, type, iii: $i > $i > $o). 1.44/0.72 thf(decl_204, type, esk47_0: $i). 1.44/0.72 thf(decl_205, type, esk48_0: $i). 1.44/0.72 thf(decl_206, type, esk49_0: $i). 1.44/0.72 thf(decl_207, type, esk50_0: $i). 1.44/0.72 thf(def_d_not, axiom, ((d_not)=(^[X36:$o]:((imp @ ((X36)) @ (~($true)))))), file('/export/starexec/sandbox2/tmp/tmp.K6gLfAsRkc/E---3.1_27469.p', def_d_not)). 1.44/0.72 thf(def_imp, axiom, ((imp)=(^[X34:$o, X35:$o]:(((X34)=>(X35))))), file('/export/starexec/sandbox2/tmp/tmp.K6gLfAsRkc/E---3.1_27469.p', def_imp)). 1.44/0.72 thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox2/tmp/tmp.K6gLfAsRkc/E---3.1_27469.p', def_all_of)). 1.44/0.72 thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox2/tmp/tmp.K6gLfAsRkc/E---3.1_27469.p', def_is_of)). 1.44/0.72 thf(def_non, axiom, ((non)=(^[X1:$i, X2:$i > $o, X4:$i]:((d_not @ ((X2 @ X4)))))), file('/export/starexec/sandbox2/tmp/tmp.K6gLfAsRkc/E---3.1_27469.p', def_non)). 1.44/0.72 thf(def_l_some, axiom, ((l_some)=(^[X1:$i, X2:$i > $o]:((d_not @ ((all_of @ (^[X4:$i]:((in @ X4 @ X1))) @ (non @ X1 @ X2))))))), file('/export/starexec/sandbox2/tmp/tmp.K6gLfAsRkc/E---3.1_27469.p', def_l_some)). 1.44/0.72 thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox2/tmp/tmp.K6gLfAsRkc/E---3.1_27469.p', def_e_is)). 1.44/0.72 thf(def_diffprop, axiom, ((diffprop)=(^[X1:$i, X183:$i, X4:$i]:((n_is @ X1 @ (n_pl @ X183 @ X4))))), file('/export/starexec/sandbox2/tmp/tmp.K6gLfAsRkc/E---3.1_27469.p', def_diffprop)). 1.44/0.72 thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox2/tmp/tmp.K6gLfAsRkc/E---3.1_27469.p', def_n_is)). 1.44/0.72 thf(def_iii, axiom, ((iii)=(^[X1:$i, X185:$i]:((n_some @ (diffprop @ X185 @ X1))))), file('/export/starexec/sandbox2/tmp/tmp.K6gLfAsRkc/E---3.1_27469.p', def_iii)). 1.44/0.72 thf(def_n_some, axiom, ((n_some)=(^[Z0/* 3 */:$i > $o]:((((((![X445:$i]:(((((in @ X445 @ nat)))=>((((((Z0 @ X445)))=>(~($true))))))))))=>(~($true))))))), file('/export/starexec/sandbox2/tmp/tmp.K6gLfAsRkc/E---3.1_27469.p', def_n_some)). 1.44/0.72 thf(satz19c, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X240:$i]:((in @ X240 @ nat))) @ (^[X241:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:(((iii @ (n_pl @ X1 @ X4) @ (n_pl @ X241 @ X4))<=(iii @ X1 @ X241))))))))))), file('/export/starexec/sandbox2/tmp/tmp.K6gLfAsRkc/E---3.1_27469.p', satz19c)). 1.44/0.72 thf(satz5, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X242:$i]:((in @ X242 @ nat))) @ (^[X243:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:((n_is @ (n_pl @ (n_pl @ X1 @ X243) @ X4) @ (n_pl @ X1 @ (n_pl @ X243 @ X4)))))))))))), file('/export/starexec/sandbox2/tmp/tmp.K6gLfAsRkc/E---3.1_27469.p', satz5)). 1.44/0.72 thf(satz6, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X229:$i]:((in @ X229 @ nat))) @ (^[X230:$i]:((n_is @ (n_pl @ X1 @ X230) @ (n_pl @ X230 @ X1)))))))), file('/export/starexec/sandbox2/tmp/tmp.K6gLfAsRkc/E---3.1_27469.p', satz6)). 1.44/0.72 thf(c_0_14, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_d_not])). 1.44/0.72 thf(c_0_15, plain, ((imp)=(^[Z0/* 19 */:$o, Z1:$o]:(((Z0)=>(Z1))))), inference(fof_simplification,[status(thm)],[def_imp])). 1.44/0.72 thf(c_0_16, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])). 1.44/0.72 thf(c_0_17, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])). 1.44/0.72 thf(c_0_18, plain, ((non)=(^[Z0/* 19 */:$i, Z1:$i > $o, Z2:$i]:((((((Z1 @ Z2)))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_non])). 1.44/0.72 thf(c_0_19, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(apply_def,[status(thm)],[c_0_14, c_0_15])). 1.44/0.72 thf(c_0_20, plain, ((l_some)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((((((![X418:$i]:(((((in @ X418 @ Z0)))=>((((((Z1 @ X418)))=>(~($true))))))))))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_l_some])). 1.44/0.72 thf(c_0_21, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_16, c_0_17])). 1.44/0.72 thf(c_0_22, plain, ((non)=(^[Z0/* 19 */:$i, Z1:$i > $o, Z2:$i]:((((((Z1 @ Z2)))=>(~($true))))))), inference(apply_def,[status(thm)],[c_0_18, c_0_19])). 1.44/0.72 thf(c_0_23, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])). 1.44/0.72 thf(c_0_24, plain, ((l_some)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((((((![X418:$i]:(((((in @ X418 @ Z0)))=>((((((Z1 @ X418)))=>(~($true))))))))))=>(~($true))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20, c_0_21]), c_0_19]), c_0_22])). 1.44/0.72 thf(c_0_25, plain, ((diffprop)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2)))))), inference(fof_simplification,[status(thm)],[def_diffprop])). 1.44/0.72 thf(c_0_26, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_23])). 1.44/0.72 thf(c_0_27, plain, ((iii)=(^[Z0/* 19 */:$i, Z1:$i]:((((((![X457:$i]:(((((in @ X457 @ nat)))=>(((((((((Z1)=(n_pl @ Z0 @ X457))))))=>(~($true))))))))))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_iii])). 1.44/0.72 thf(c_0_28, axiom, ((n_some)=(^[Z0/* 3 */:$i > $o]:((((((![X445:$i]:(((((in @ X445 @ nat)))=>((((((Z0 @ X445)))=>(~($true))))))))))=>(~($true))))))), inference(apply_def,[status(thm)],[def_n_some, c_0_24])). 1.44/0.72 thf(c_0_29, plain, ((diffprop)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2)))))), inference(apply_def,[status(thm)],[c_0_25, c_0_26])). 1.44/0.72 thf(c_0_30, plain, ((iii)=(^[Z0/* 19 */:$i, Z1:$i]:((((((![X457:$i]:(((((in @ X457 @ nat)))=>(((((((((Z1)=(n_pl @ Z0 @ X457))))))=>(~($true))))))))))=>(~($true))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_27, c_0_28]), c_0_29])). 1.44/0.72 thf(c_0_31, negated_conjecture, ~(![X647:$i]:(((in @ X647 @ nat)=>![X646:$i]:(((in @ X646 @ nat)=>![X645:$i]:(((in @ X645 @ nat)=>((![X644:$i]:(((in @ X644 @ nat)=>(((X646)=(n_pl @ X647 @ X644))=>~($true))))=>~($true))=>(![X643:$i]:(((in @ X643 @ nat)=>(((n_pl @ X646 @ X645)=(n_pl @ (n_pl @ X647 @ X645) @ X643))=>~($true))))=>~($true)))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz19c])]), c_0_21]), c_0_30])])). 1.44/0.72 thf(c_0_32, negated_conjecture, ![X1046:$i]:(((in @ esk47_0 @ nat)&((in @ esk48_0 @ nat)&((in @ esk49_0 @ nat)&((((in @ esk50_0 @ nat)|~($true))&((((esk48_0)=(n_pl @ esk47_0 @ esk50_0))|~($true))&(($true)|~($true))))&((~(in @ X1046 @ nat)|(((n_pl @ esk48_0 @ esk49_0)!=(n_pl @ (n_pl @ esk47_0 @ esk49_0) @ X1046))|~($true)))&($true))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])])])])])). 1.44/0.72 thf(c_0_33, plain, ![X651:$i]:(((in @ X651 @ nat)=>![X650:$i]:(((in @ X650 @ nat)=>![X649:$i]:(((in @ X649 @ nat)=>((n_pl @ (n_pl @ X651 @ X650) @ X649)=(n_pl @ X651 @ (n_pl @ X650 @ X649))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz5]), c_0_21]), c_0_26])). 1.44/0.72 thf(c_0_34, negated_conjecture, ![X1:$i]:((~((in @ X1 @ nat))|((n_pl @ esk48_0 @ esk49_0)!=(n_pl @ (n_pl @ esk47_0 @ esk49_0) @ X1))|~(($true)))), inference(split_conjunct,[status(thm)],[c_0_32])). 1.44/0.72 thf(c_0_35, plain, ![X1048:$i, X1049:$i, X1050:$i]:((~(in @ X1048 @ nat)|(~(in @ X1049 @ nat)|(~(in @ X1050 @ nat)|((n_pl @ (n_pl @ X1048 @ X1049) @ X1050)=(n_pl @ X1048 @ (n_pl @ X1049 @ X1050))))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])])])). 1.44/0.72 thf(c_0_36, plain, ![X624:$i]:(((in @ X624 @ nat)=>![X623:$i]:(((in @ X623 @ nat)=>((n_pl @ X624 @ X623)=(n_pl @ X623 @ X624)))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz6]), c_0_21]), c_0_26])). 1.44/0.72 thf(c_0_37, negated_conjecture, ![X1:$i]:((((n_pl @ esk48_0 @ esk49_0)!=(n_pl @ (n_pl @ esk47_0 @ esk49_0) @ X1))|~((in @ X1 @ nat)))), inference(cn,[status(thm)],[c_0_34])). 1.44/0.72 thf(c_0_38, plain, ![X1:$i, X4:$i, X5:$i]:((((n_pl @ (n_pl @ X1 @ X4) @ X5)=(n_pl @ X1 @ (n_pl @ X4 @ X5)))|~((in @ X1 @ nat))|~((in @ X4 @ nat))|~((in @ X5 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_35])). 1.44/0.72 thf(c_0_39, negated_conjecture, (in @ esk49_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_32])). 1.44/0.72 thf(c_0_40, negated_conjecture, (in @ esk47_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_32])). 1.44/0.72 thf(c_0_41, plain, ![X1022:$i, X1023:$i]:((~(in @ X1022 @ nat)|(~(in @ X1023 @ nat)|((n_pl @ X1022 @ X1023)=(n_pl @ X1023 @ X1022))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])])])). 1.44/0.72 thf(c_0_42, negated_conjecture, (((esk48_0)=(n_pl @ esk47_0 @ esk50_0))|~(($true))), inference(split_conjunct,[status(thm)],[c_0_32])). 1.44/0.72 thf(c_0_43, negated_conjecture, ((in @ esk50_0 @ nat)|~(($true))), inference(split_conjunct,[status(thm)],[c_0_32])). 1.44/0.72 thf(c_0_44, negated_conjecture, ![X1:$i]:((((n_pl @ esk47_0 @ (n_pl @ esk49_0 @ X1))!=(n_pl @ esk48_0 @ esk49_0))|~((in @ X1 @ nat)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_38]), c_0_39]), c_0_40])])). 1.44/0.72 thf(c_0_45, plain, ![X1:$i, X4:$i]:((((n_pl @ X1 @ X4)=(n_pl @ X4 @ X1))|~((in @ X1 @ nat))|~((in @ X4 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_41])). 1.44/0.72 thf(c_0_46, negated_conjecture, ((esk48_0)=(n_pl @ esk47_0 @ esk50_0)), inference(cn,[status(thm)],[c_0_42])). 1.44/0.72 thf(c_0_47, negated_conjecture, (in @ esk50_0 @ nat), inference(cn,[status(thm)],[c_0_43])). 1.44/0.72 thf(c_0_48, negated_conjecture, ![X1:$i]:((((n_pl @ esk47_0 @ (n_pl @ X1 @ esk49_0))!=(n_pl @ esk48_0 @ esk49_0))|~((in @ X1 @ nat)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44, c_0_45]), c_0_39])])). 1.44/0.72 thf(c_0_49, negated_conjecture, ![X1:$i]:((((n_pl @ esk47_0 @ (n_pl @ esk50_0 @ X1))=(n_pl @ esk48_0 @ X1))|~((in @ X1 @ nat)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_46]), c_0_47]), c_0_40])])). 1.44/0.72 thf(c_0_50, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48, c_0_49]), c_0_47]), c_0_39])]), ['proof']). 1.44/0.72 # SZS output end CNFRefutation 1.44/0.72 # Parsed axioms : 371 1.44/0.72 # Removed by relevancy pruning/SinE : 0 1.44/0.72 # Initial clauses : 790 1.44/0.72 # Removed in clause preprocessing : 477 1.44/0.72 # Initial clauses in saturation : 313 1.44/0.72 # Processed clauses : 641 1.44/0.72 # ...of these trivial : 6 1.44/0.72 # ...subsumed : 66 1.44/0.72 # ...remaining for further processing : 569 1.44/0.72 # Other redundant clauses eliminated : 90 1.44/0.72 # Clauses deleted for lack of memory : 0 1.44/0.72 # Backward-subsumed : 10 1.44/0.72 # Backward-rewritten : 3 1.44/0.72 # Generated clauses : 1741 1.44/0.72 # ...of the previous two non-redundant : 1682 1.44/0.72 # ...aggressively subsumed : 0 1.44/0.72 # Contextual simplify-reflections : 13 1.44/0.72 # Paramodulations : 1563 1.44/0.72 # Factorizations : 2 1.44/0.72 # NegExts : 0 1.44/0.72 # Equation resolutions : 95 1.44/0.72 # Disequality decompositions : 0 1.44/0.72 # Total rewrite steps : 210 1.44/0.72 # ...of those cached : 179 1.44/0.72 # Propositional unsat checks : 0 1.44/0.72 # Propositional check models : 0 1.44/0.72 # Propositional check unsatisfiable : 0 1.44/0.72 # Propositional clauses : 0 1.44/0.72 # Propositional clauses after purity: 0 1.44/0.72 # Propositional unsat core size : 0 1.44/0.72 # Propositional preprocessing time : 0.000 1.44/0.72 # Propositional encoding time : 0.000 1.44/0.72 # Propositional solver time : 0.000 1.44/0.72 # Success case prop preproc time : 0.000 1.44/0.72 # Success case prop encoding time : 0.000 1.44/0.72 # Success case prop solver time : 0.000 1.44/0.72 # Current number of processed clauses : 224 1.44/0.72 # Positive orientable unit clauses : 76 1.44/0.72 # Positive unorientable unit clauses: 2 1.44/0.72 # Negative unit clauses : 12 1.44/0.72 # Non-unit-clauses : 134 1.44/0.72 # Current number of unprocessed clauses: 1611 1.44/0.72 # ...number of literals in the above : 5415 1.44/0.72 # Current number of archived formulas : 0 1.44/0.72 # Current number of archived clauses : 288 1.44/0.72 # Clause-clause subsumption calls (NU) : 24327 1.44/0.72 # Rec. Clause-clause subsumption calls : 3758 1.44/0.72 # Non-unit clause-clause subsumptions : 72 1.44/0.72 # Unit Clause-clause subsumption calls : 489 1.44/0.72 # Rewrite failures with RHS unbound : 14 1.44/0.72 # BW rewrite match attempts : 62 1.44/0.72 # BW rewrite match successes : 3 1.44/0.72 # Condensation attempts : 0 1.44/0.72 # Condensation successes : 0 1.44/0.72 # Termbank termtop insertions : 132236 1.44/0.72 # Search garbage collected termcells : 28359 1.44/0.72 1.44/0.72 # ------------------------------------------------- 1.44/0.72 # User time : 0.167 s 1.44/0.72 # System time : 0.013 s 1.44/0.72 # Total time : 0.180 s 1.44/0.72 # Maximum resident set size: 6048 pages 1.44/0.72 1.44/0.72 # ------------------------------------------------- 1.44/0.72 # User time : 0.174 s 1.44/0.72 # System time : 0.015 s 1.44/0.72 # Total time : 0.189 s 1.44/0.72 # Maximum resident set size: 2328 pages 1.44/0.72 % E exiting 1.44/0.72 % E exiting 1.44/0.72 EOF